Deterministic parallel backtrack search

Fast Deterministic Backtrack Search

The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. This note describes a fast, deterministic backtrack search algorithm for a p-processor COMMON CRCW-PRAM that visits any n-node tree of height h in time O ? (n=p + h)(log log lo...

Parllel Backtrack Search on DisCSP

A parallel algorithm for solving distributed constraint networks (DCNs) is presented. The DCNs are composed of agents, each holding a local network of constraints, where all agents are connected by constraints. The parallel backtracking algorithm (PBT) initiates multiple search processes (SPs) that operate in parallel. Parallel search processes scan different parts of the search tree, each repr...

Concurrent Backtrack Search on DisCSPs

A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SPs) that operate concurrently. Concurrent search processes scan nonintersecting parts of the search space. Each SP is represented by a unique data structure, containing a current partial assignment (CPA), that is circul...

Unrestricted Backtrack Search for Propositional Satisfiability

Backtrack-Free Search for Resource Allocation Problems

Freuder 9] has previously given conditions that guarantee backtrack-free search when solving binary constraint networks. Freuder's condition relies on the \width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings of the vertices in the network. This paper presents an similar result for backtrack-free search when solving resour...